package ds.tree.binarytree;

public class Node {

	int iData;
	Node leftChild;
	Node rightChild;
	
	public void setLeftSubTree(BinaryTree tree)
	{
		leftChild = tree.root;
	}
	
	public void setRightSubTree(BinaryTree tree)
	{
		rightChild = tree.root;
	}
	
	public void display()
	{
		
	}

	public int getIData() {
		return iData;
	}

	public Node getLeftChild() {
		return leftChild;
	}

	public Node getRightChild() {
		return rightChild;
	}
}
